path-sum-iii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> of a binary tree and an integer <code>targetSum</code>, return the number of paths where the sum of the values&nbsp;along the path equals&nbsp;<code>targetSum</code>.

The path does not need to start or end at the root or a leaf, but it must go downwards (i.e., traveling only from parent nodes to child nodes).

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/pathsum3-1-tree.jpg" style="width: 450px; height: 386px;" />
<pre>
Input: root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8
Output: 3
Explanation: The paths that sum to 8 are shown.
</pre>

Example 2:

<pre>
Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
Output: 3
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 1000]</code>.</li>
	<li><code>-109 &lt;= Node.val &lt;= 109</code></li>
	<li><code>-1000 &lt;= targetSum &lt;= 1000</code></li>
</ul>

pathSum

Path Sum III

Path Sum

path-sum

路径总和

Path Sum II

path-sum-ii

路径总和 II

Path Sum IV

path-sum-iv

路径总和 IV

Longest Univalue Path

longest-univalue-path

最长同值路径

Tree

Depth-First Search

Binary Tree

给定一个二叉树的根节点 <code>root</code> ，和一个整数 <code>targetSum</code> ，求该二叉树里节点值之和等于 <code>targetSum</code> 的 路径 的数目。

路径 不需要从根节点开始，也不需要在叶子节点结束，但是路径方向必须是向下的（只能从父节点到子节点）。

 

示例 1：

<img src="https://assets.leetcode.com/uploads/2021/04/09/pathsum3-1-tree.jpg" style="width: 452px; " />

<pre>
输入：root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8
输出：3
解释：和等于 8 的路径有 3 条，如图所示。
</pre>

示例 2：

<pre>
输入：root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
输出：3
</pre>

 

提示:

<ul>
	<li>二叉树的节点个数的范围是 <code>[0,1000]</code></li>
	<li><meta charset="UTF-8" /><code>-109 <= Node.val <= 109</code> </li>
	<li><code>-1000 <= targetSum <= 1000</code> </li>
</ul>